Some Relations between Spectral Geometry and Number Theory
نویسنده
چکیده
In his paper Mc], whose object was to show that the spectrum of the Laplacian of a Riemannian surface S determines the surface up to nitely many possibilities , Henry McKean proved the following result, which he called the \Riemann hypothesis for Riemann surfaces": Theorem (McKean Mc]). If S is a hyperbolic Riemann surface, then the rst eigenvalue 1 (S) of the Laplacian on S satisses 1 (S) 14: Here, the term \Riemann surface" denotes a compact, oriented surface with a constant curvature metric. The term \hyperbolic" means that the constant is equal to ?1, so that S has genus > 1. The number 14 arises because it is the bottom 0 (H 2) of the L 2-spectrum of the Laplacian of the hyperbolic plane. The content of McKean's theorem was thus to relate the rst eigenvalue 1 (S) with the bottom of the spectrum of the universal cover e S = H 2. Actually, the term \proved" is used somewhat loosely here, because McKean's proof, to which we will return shortly, contained a fatal mistake. Indeed, it was observed shortly afterwards by Burt Randol that the result was indeed wrong, in the following strong sense: Theorem (B. Randol Ra]). Let S be a hyperbolic Riemann surface. Then there exist arbitrarily large i-fold coverings S i of S such that 1 (S i) ! 0 as i ! 1. The examples of Randol are fairly easy to describe: Let be a simple closed geodesic on S which does not divide S into two pieces. Then we may open S up by cutting it along , make i copies of S for some large i, and have them \link hands" to form a circle S i of surfaces: To see that 1 (S i) ! 0 as i ! 1, we may construct test funcxtions on S i in the following way: Assuming that i is even, divide S i into two sets A and B of copies of S| for instance, the left half of S i and the right half| so that A and B meet in two coipes of. Then let f i be +1 on A and ?1 on B, and change in some standard way from +1 to ?1 in neighborhoods of the two copies of .
منابع مشابه
Instrument dependency of Kubelka-Munk theory in computer color matching
Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...
متن کاملTheoretical study of the influence of solvent polarity on the structure and spectral properties in the interaction of C20 and Si2H2
In this investigation, the interaction of C20 and Si2H2 molecules was explored in the M06-2X/6-311++G(d,p)level of theory in gas solution phases. The obtained interaction energy values with standard method werecorrected by basis set superposition error (BSSE) during the geometry optimization for all molecules atthe same level of theory. Also, the bonding interaction between th...
متن کاملDiscrete Isoperimetric Inequalities
One of the earliest problems in geometry is the isoperimetric problem, which was considered by the ancient Greeks. The problem is to find, among all closed curves of a given length, the one which encloses the maximum area. Isoperimetric problems for the discrete domain are in the same spirit but with different complexity. A basic model for communication and computational networks is a graph G =...
متن کاملThe Concept of Power in International Relations
The terms of Power, influence and authority could be heard in political world vastly, but using these terms is not leaving only to this realm. Despite its visual simplicity, generally there is not similar and equal perception about term of Power among people. Understanding about by politicians differs from lawyer perception about this term. What people takes about Power, totally differ from wh...
متن کاملSome relations between Kekule structure and Morgan-Voyce polynomials
In this paper, Kekule structures of benzenoid chains are considered. It has been shown that the coefficients of a B_n (x) Morgan-Voyce polynomial equal to the number of k-matchings (m(G,k)) of a path graph which has N=2n+1 points. Furtermore, two relations are obtained between regularly zig-zag nonbranched catacondensed benzenid chains and Morgan-Voyce polynomials and between regularly zig-zag ...
متن کاملOn the sensitivity of the spectral projection
In this paper, we apply the theory of condition developed by Rice to define condition numbers of the spectral projection. Explicit expressions of the condition numbers are derived, and some relations between the condition numbers of the spectral projection and the condition number of the associated invariant subspace are presented. The results are illustrated by a simple numerical example. © 20...
متن کامل